A Petri net model to determine optimal assembly sequences with assembly operation constraints
Identifieur interne : 002645 ( Main/Exploration ); précédent : 002644; suivant : 002646A Petri net model to determine optimal assembly sequences with assembly operation constraints
Auteurs : Shang-Tae Yee [États-Unis] ; Jose A. Ventura [États-Unis]Source :
- Journal of Manufacturing Systems [ 0278-6125 ] ; 1999.
Abstract
The assembly process in an automated assembly system is the execution of successive assembly operations in which each operation joins one component with another component to form a larger component. The selection of the assembly sequence of a product has a great effect on the efficiency of the assembly process. A systematic procedure is needed not only to generate all feasible assembly sequences but also to choose an optimal sequence. This paper describes a method for finding tight bounds on optimal sequences in an assembly system. A Petri net obtained from the AND/OR graph of a product can be formulated as a 0–1 integer linear program that minimizes the total assembly time or cost while satisfying three assembly operation constraints, namely, ease of component handling, ease of component joining, and tool changes. A Lagrangian dual formulation is then developed to obtain a lower bound. A dynamic programming algorithm provides a dual solution, and a subgradient optimization algorithm is used to maximize the lower bound obtained from the dual problem. The solution procedure is validated by determining the optimal assembly sequences of three products.
Url:
DOI: 10.1016/S0278-6125(99)80032-6
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001949
- to stream Istex, to step Curation: 001949
- to stream Istex, to step Checkpoint: 000C47
- to stream Main, to step Merge: 002756
- to stream Main, to step Curation: 002645
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>A Petri net model to determine optimal assembly sequences with assembly operation constraints</title><author><name sortKey="Yee, Shang Tae" sort="Yee, Shang Tae" uniqKey="Yee S" first="Shang-Tae" last="Yee">Shang-Tae Yee</name></author><author><name sortKey="Ventura, Jose A" sort="Ventura, Jose A" uniqKey="Ventura J" first="Jose A." last="Ventura">Jose A. Ventura</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:5EDD8F08A5049C685F00B092942D821DD22621C9</idno><date when="1999" year="1999">1999</date><idno type="doi">10.1016/S0278-6125(99)80032-6</idno><idno type="url">https://api.istex.fr/document/5EDD8F08A5049C685F00B092942D821DD22621C9/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001949</idno><idno type="wicri:Area/Istex/Curation">001949</idno><idno type="wicri:Area/Istex/Checkpoint">000C47</idno><idno type="wicri:doubleKey">0278-6125:1999:Yee S:a:petri:net</idno><idno type="wicri:Area/Main/Merge">002756</idno><idno type="wicri:Area/Main/Curation">002645</idno><idno type="wicri:Area/Main/Exploration">002645</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">A Petri net model to determine optimal assembly sequences with assembly operation constraints</title><author><name sortKey="Yee, Shang Tae" sort="Yee, Shang Tae" uniqKey="Yee S" first="Shang-Tae" last="Yee">Shang-Tae Yee</name><affiliation wicri:level="4"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Dept. of Industrial and Manufacturing Engineering, The Pennsylvania State University, University Park, Pennsylvania</wicri:regionArea><placeName><region type="state">Pennsylvanie</region></placeName><orgName type="university">Université d'État de Pennsylvanie</orgName></affiliation></author><author><name sortKey="Ventura, Jose A" sort="Ventura, Jose A" uniqKey="Ventura J" first="Jose A." last="Ventura">Jose A. Ventura</name><affiliation wicri:level="4"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Dept. of Industrial and Manufacturing Engineering, The Pennsylvania State University, University Park, Pennsylvania</wicri:regionArea><placeName><region type="state">Pennsylvanie</region></placeName><orgName type="university">Université d'État de Pennsylvanie</orgName></affiliation></author></analytic><monogr></monogr><series><title level="j">Journal of Manufacturing Systems</title><title level="j" type="abbrev">JMSY</title><idno type="ISSN">0278-6125</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1999">1999</date><biblScope unit="volume">18</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="203">203</biblScope><biblScope unit="page" to="213">213</biblScope></imprint><idno type="ISSN">0278-6125</idno></series><idno type="istex">5EDD8F08A5049C685F00B092942D821DD22621C9</idno><idno type="DOI">10.1016/S0278-6125(99)80032-6</idno><idno type="PII">S0278-6125(99)80032-6</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0278-6125</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">The assembly process in an automated assembly system is the execution of successive assembly operations in which each operation joins one component with another component to form a larger component. The selection of the assembly sequence of a product has a great effect on the efficiency of the assembly process. A systematic procedure is needed not only to generate all feasible assembly sequences but also to choose an optimal sequence. This paper describes a method for finding tight bounds on optimal sequences in an assembly system. A Petri net obtained from the AND/OR graph of a product can be formulated as a 0–1 integer linear program that minimizes the total assembly time or cost while satisfying three assembly operation constraints, namely, ease of component handling, ease of component joining, and tool changes. A Lagrangian dual formulation is then developed to obtain a lower bound. A dynamic programming algorithm provides a dual solution, and a subgradient optimization algorithm is used to maximize the lower bound obtained from the dual problem. The solution procedure is validated by determining the optimal assembly sequences of three products.</div></front></TEI><affiliations><list><country><li>États-Unis</li></country><region><li>Pennsylvanie</li></region><orgName><li>Université d'État de Pennsylvanie</li></orgName></list><tree><country name="États-Unis"><region name="Pennsylvanie"><name sortKey="Yee, Shang Tae" sort="Yee, Shang Tae" uniqKey="Yee S" first="Shang-Tae" last="Yee">Shang-Tae Yee</name></region><name sortKey="Ventura, Jose A" sort="Ventura, Jose A" uniqKey="Ventura J" first="Jose A." last="Ventura">Jose A. Ventura</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/OperaV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002645 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002645 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= OperaV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:5EDD8F08A5049C685F00B092942D821DD22621C9
|texte= A Petri net model to determine optimal assembly sequences with assembly operation constraints
}}
| This area was generated with Dilib version V0.6.21. |  |